An K - Step Preconditioned Conjugate Gradient Hethod
نویسنده
چکیده
Tbis paper describes a preconditioned conjugate gradient method tbat can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systema of linear equations. The implementation on the CYBER 203/205 and on tbe Finite Element Machine is discuased and result a obtained using the method on these machines are siven.
منابع مشابه
Computing the Projection in an Interior
Global convergence of the long-step aane scaling algorithm for degenerate linear programming problems, 9 tion time can be achieved by using a preconditioned conjugate gradient linear system solver. Convergence of the large step primal aane-scaling algorithm for primal non-degenerate linear programs,
متن کاملSolution accelerators for large-scale three-dimensional electromagnetic inverse problems
We provide a framework for preconditioning nonlinear three-dimensional electromagnetic inverse scattering problems using nonlinear conjugate gradient (NLCG) and limited memory (LM) quasi-Newton methods. Key to our approach is the use of an approximate adjoint method that allows for an economical approximation of the Hessian that is updated at each inversion iteration. Using this approximate Hes...
متن کاملMicrosoft Word - 10001.rtf
This paper reports work done to improve the modeling of complex processes when only small experimental data sets are available. Neural networks are used to capture the nonlinear underlying phenomena contained in the data set and to partly eliminate the burden of having to specify completely the structure of the model. Two different types of neural networks were used for the application of Pulpi...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملModeling of Pulping of Sugar Maple Using Advanced Neural Network Learning
This paper reports work done to improve the modeling of complex processes when only small experimental data sets are available. Neural networks are used to capture the nonlinear underlying phenomena contained in the data set and to partly eliminate the burden of having to specify completely the structure of the model. Two different types of neural networks were used for the application of Pulpi...
متن کامل